0.11/0.17 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.18 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.39 % Computer : n004.cluster.edu 0.12/0.39 % Model : x86_64 x86_64 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.39 % Memory : 8042.1875MB 0.12/0.39 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.39 % CPULimit : 1200 0.12/0.39 % WCLimit : 120 0.12/0.39 % DateTime : Tue Jul 13 15:47:54 EDT 2021 0.12/0.39 % CPUTime : 0.12/0.39 % Number of cores: 8 0.12/0.39 % Python version: Python 3.6.8 0.12/0.40 # Version: 2.6rc1-ho 0.12/0.40 # No SInE strategy applied 0.12/0.40 # Trying AutoSched0 for 59 seconds 0.19/0.43 # AutoSched0-Mode selected heuristic H_____102_C00_02_nc_F1_PI_AE_CS_SP_PS_S2S 0.19/0.43 # and selection function SelectNewComplexAHP. 0.19/0.43 # 0.19/0.43 # Preprocessing time : 0.027 s 0.19/0.43 # Presaturation interreduction done 0.19/0.43 0.19/0.43 # Proof found! 0.19/0.43 # SZS status Theorem 0.19/0.43 # SZS output start CNFRefutation 0.19/0.43 thf(cTHM20_pme, conjecture, (![X1:a, X2:a]:?[X3:a]:(cP @ X1 @ X3)=(X2)<=((![X4:a]:(cP @ cE @ X4)=(X4)&![X5:a]:(cP @ (cJ @ X5) @ X5)=(cE))&![X4:a, X5:a, X6:a]:(cP @ (cP @ X4 @ X5) @ X6)=(cP @ X4 @ (cP @ X5 @ X6)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM20_pme)). 0.19/0.43 thf(c_0_1, negated_conjecture, ~((((![X4:a]:(cP @ cE @ X4)=(X4)&![X5:a]:(cP @ (cJ @ X5) @ X5)=(cE))&![X4:a, X5:a, X6:a]:(cP @ (cP @ X4 @ X5) @ X6)=(cP @ X4 @ (cP @ X5 @ X6)))=>![X1:a, X2:a]:?[X3:a]:(cP @ X1 @ X3)=(X2))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM20_pme])])). 0.19/0.43 thf(c_0_2, negated_conjecture, ![X15:a, X16:a, X17:a, X18:a, X19:a, X22:a]:((((cP @ cE @ X15)=(X15)&(cP @ (cJ @ X16) @ X16)=(cE))&(cP @ (cP @ X17 @ X18) @ X19)=(cP @ X17 @ (cP @ X18 @ X19)))&(cP @ esk1_0 @ X22)!=(esk2_0)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.19/0.43 thf(c_0_3, negated_conjecture, ![X1:a, X2:a, X3:a]:(cP @ (cP @ X1 @ X2) @ X3)=(cP @ X1 @ (cP @ X2 @ X3)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.43 thf(c_0_4, negated_conjecture, ![X1:a]:(cP @ (cJ @ X1) @ X1)=(cE), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.43 thf(c_0_5, negated_conjecture, ![X1:a]:(cP @ cE @ X1)=(X1), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.43 thf(c_0_6, negated_conjecture, ![X1:a, X2:a]:(cP @ (cJ @ X1) @ (cP @ X1 @ X2))=(X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3, c_0_4]), c_0_5])). 0.19/0.43 thf(c_0_7, negated_conjecture, ![X1:a]:(cP @ (cJ @ (cJ @ X1)) @ cE)=(X1), inference(spm,[status(thm)],[c_0_6, c_0_4])). 0.19/0.43 thf(c_0_8, negated_conjecture, ![X1:a, X2:a]:(cP @ (cJ @ (cJ @ X1)) @ X2)=(cP @ X1 @ X2), inference(spm,[status(thm)],[c_0_6, c_0_6])). 0.19/0.43 thf(c_0_9, negated_conjecture, ![X1:a]:(cP @ X1 @ cE)=(X1), inference(rw,[status(thm)],[c_0_7, c_0_8])). 0.19/0.43 thf(c_0_10, negated_conjecture, ![X1:a]:(cJ @ (cJ @ X1))=(X1), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_9])). 0.19/0.43 thf(c_0_11, negated_conjecture, ![X1:a]:(cP @ esk1_0 @ X1)!=(esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.43 thf(c_0_12, negated_conjecture, ![X1:a, X2:a]:(cP @ X1 @ (cP @ (cJ @ X1) @ X2))=(X2), inference(spm,[status(thm)],[c_0_6, c_0_10])). 0.19/0.43 thf(c_0_13, negated_conjecture, ![X1:a]:(X1)!=(esk2_0), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.19/0.43 thf(c_0_14, negated_conjecture, ($false), inference(er,[status(thm)],[c_0_13]), ['proof']). 0.19/0.43 # SZS output end CNFRefutation 0.19/0.43 # Proof object total steps : 15 0.19/0.43 # Proof object clause steps : 12 0.19/0.43 # Proof object formula steps : 3 0.19/0.43 # Proof object conjectures : 15 0.19/0.43 # Proof object clause conjectures : 12 0.19/0.43 # Proof object formula conjectures : 3 0.19/0.43 # Proof object initial clauses used : 4 0.19/0.43 # Proof object initial formulas used : 1 0.19/0.43 # Proof object generating inferences : 7 0.19/0.43 # Proof object simplifying inferences : 3 0.19/0.43 # Training examples: 0 positive, 0 negative 0.19/0.43 # Parsed axioms : 5 0.19/0.43 # Removed by relevancy pruning/SinE : 0 0.19/0.43 # Initial clauses : 8 0.19/0.43 # Removed in clause preprocessing : 4 0.19/0.43 # Initial clauses in saturation : 4 0.19/0.43 # Processed clauses : 23 0.19/0.43 # ...of these trivial : 2 0.19/0.43 # ...subsumed : 0 0.19/0.43 # ...remaining for further processing : 21 0.19/0.43 # Other redundant clauses eliminated : 0 0.19/0.43 # Clauses deleted for lack of memory : 0 0.19/0.43 # Backward-subsumed : 0 0.19/0.43 # Backward-rewritten : 4 0.19/0.43 # Generated clauses : 53 0.19/0.43 # ...of the previous two non-trivial : 23 0.19/0.43 # Contextual simplify-reflections : 0 0.19/0.43 # Paramodulations : 51 0.19/0.43 # Factorizations : 0 0.19/0.43 # NegExts : 0 0.19/0.43 # Equation resolutions : 1 0.19/0.43 # Propositional unsat checks : 0 0.19/0.43 # Propositional check models : 0 0.19/0.43 # Propositional check unsatisfiable : 0 0.19/0.43 # Propositional clauses : 0 0.19/0.43 # Propositional clauses after purity: 0 0.19/0.43 # Propositional unsat core size : 0 0.19/0.43 # Propositional preprocessing time : 0.000 0.19/0.43 # Propositional encoding time : 0.000 0.19/0.43 # Propositional solver time : 0.000 0.19/0.43 # Success case prop preproc time : 0.000 0.19/0.43 # Success case prop encoding time : 0.000 0.19/0.43 # Success case prop solver time : 0.000 0.19/0.43 # Current number of processed clauses : 13 0.19/0.43 # Positive orientable unit clauses : 9 0.19/0.43 # Positive unorientable unit clauses: 0 0.19/0.43 # Negative unit clauses : 4 0.19/0.43 # Non-unit-clauses : 0 0.19/0.43 # Current number of unprocessed clauses: 6 0.19/0.43 # ...number of literals in the above : 6 0.19/0.43 # Current number of archived formulas : 0 0.19/0.43 # Current number of archived clauses : 8 0.19/0.43 # Clause-clause subsumption calls (NU) : 0 0.19/0.43 # Rec. Clause-clause subsumption calls : 0 0.19/0.43 # Non-unit clause-clause subsumptions : 0 0.19/0.43 # Unit Clause-clause subsumption calls : 6 0.19/0.43 # Rewrite failures with RHS unbound : 0 0.19/0.43 # BW rewrite match attempts : 4 0.19/0.43 # BW rewrite match successes : 3 0.19/0.43 # Condensation attempts : 0 0.19/0.43 # Condensation successes : 0 0.19/0.43 # Termbank termtop insertions : 690 0.19/0.43 0.19/0.43 # ------------------------------------------------- 0.19/0.43 # User time : 0.028 s 0.19/0.43 # System time : 0.003 s 0.19/0.43 # Total time : 0.031 s 0.19/0.43 # Maximum resident set size: 1644 pages 0.19/0.43 EOF